Distances between power spectral densities
نویسنده
چکیده
We present several natural notions of distance between spectral density functions of (discrete-time) random processes. They are motivated by certain filtering problems. First we quantify the degradation of performance of a predictor which is designed for a particular spectral density function and then used to predict the values of a random process having a different spectral density. The logarithm of the ratio between the variance of the error, over the corresponding minimal (optimal) variance, produces a measure of distance between the two power spectra with several desirable properties. Analogous quantities based on smoothing problems produce alternative distances and suggest a class of measures based on fractions of generalized means of ratios of power spectral densities. Index Terms Power spectral density functions, distance measures.
منابع مشابه
Spectral Density Analysis: Frequency Domain Specification and Measurement of Signal Stability
Stability in the frequency domain is commonly specified in terms of spectral densities. The spectral density concept is simple, elegant, and very useful, but care must be exercised in its use. There are several different but closely related spectral densities, which are relevant to the specification and measurement of stability of the frequency, phase, period, amplitude, and power of signals. C...
متن کاملInvestigating on the Effects of Random Irregularities of Railway Track by Half-Bogie Model
The vibrations produced by trains include two parts which are deterministic and random vibrations. Due to variation of dynamic loads and patterns of load-time, the random vibration of moving train is one of the most important issues in the field of railway engineering. One of the important sources in producing the train vibrations is rail roughness and irregularities. In this paper, responses o...
متن کاملSDE: Graph Drawing Using Spectral Distance Embedding
We present a novel graph drawing algorithm which uses a spectral decomposition of the distance matrix to approximate the graph theoretical distances. The algorithm preserves symmetry and node densities, i.e., the drawings are aesthetically pleasing. The runtime for typical 20, 000 node graphs ranges from 100 to 150 seconds.
متن کاملLTI Stochastic Processes: a Behavioral Perspective
This paper revisits the definition of linear time-invariant (LTI) stochastic process within a behavioral systems framework. Building on Willems (2013), we derive a canonical representation of an LTI stochastic process and a physically grounded notion of interconnection between independent stochastic processes. We use this framework to analyze the invariance properties enjoyed by distances betwe...
متن کاملBootstrapping Frequency Domain Tests in Multivariate Time Series with an Application to Comparing Spectral Densities
We propose a general bootstrap procedure to approximate the null distribution of nonparametric frequency domain tests about the spectral density matrix of a multivariate time series. Under a set of easy to verify conditions, we establish asymptotic validity of the proposed bootstrap procedure. We apply a version of this procedure together with a new statistic in order to test the hypothesis tha...
متن کامل